Improved Maximin Selection for Well Spread Pareto Fronts
نویسندگان
چکیده
An algorithm to achieve maximal spread and almost perfectly distributed Pareto fronts is presented. The MaxiMin algorithm add points to the archive of selected individuals one by one, each point which is added maximizes the distance from the current selected points. This method is independent of the evolutionary operators used to perform the search. This work explains how to combine the MaxiMin selection with state of the art multi-objective algorithms, such as NSGA-II, SPEA2, and DEMO. Experiments were ran with and without MaxiMin for comparison purposes. ε-MOEA is used as reference. Performance metrics and graphical results are shown for comparison.
منابع مشابه
Multi-objective MaxiMin Sorting Scheme
Obtaining a well distributed non-dominated Pareto front is one of the key issues in multi-objective optimization algorithms. This paper proposes a new variant for the elitist selection operator to the NSGA-II algorithm, which promotes well distributed non-dominated fronts. The basic idea is to replace the crowding distance method by a maximin technique. The proposed technique is deployed in wel...
متن کاملBetter Spread and Convergence: Particle Swarm Multiobjective Optimization Using the Maximin Fitness Function
Maximin strategy has its origin in game theory, but it can be adopted for effective multiobjective optimization. This paper proposes a particle swarm multiobjective optimiser, maximinPSO, which uses a fitness function derived from the maximin strategy to determine Pareto-domination. The maximin fitness function has some very desirable properties with regard to multiobjective optimization. One a...
متن کاملA Novel Pareto-Based Meta-Heuristic Algorithm to Optimize Multi-Facility Location-Allocation Problem
This article proposes a novel Pareto-based multiobjective meta-heuristic algorithm named non-dominated ranking genetic algorithm (NRGA) to solve multi-facility location-allocation problem. In NRGA, a fitness value representing rank is assigned to each individual of the population. Moreover, two features ranked based roulette wheel selection including select the fronts and choose solutions from ...
متن کاملEffects of 1-Greedy -Metric-Selection on Innumerably Large Pareto Fronts
Evolutionary multi-objective algorithms (EMOA) using performance indicators for the selection of individuals have turned out to be a successful technique for multi-objective problems. Especially, the selection based on the S-metric, as implemented in the SMS-EMOA, seems to be effective. A special feature of this EMOA is the greedy (μ+ 1) selection. Based on a pathological example for a populati...
متن کاملBeam configuration selection for robust intensity-modulated proton therapy in cervical cancer using Pareto front comparison.
The Pareto front reflects the optimal trade-offs between conflicting objectives and can be used to quantify the effect of different beam configurations on plan robustness and dose-volume histogram parameters. Therefore, our aim was to develop and implement a method to automatically approach the Pareto front in robust intensity-modulated proton therapy (IMPT) planning. Additionally, clinically r...
متن کامل